Utilization of multi-dimensional source correlation in multi-dimensional single parity check codes
نویسندگان
چکیده
This paper proposes a joint source-channel coding (JSCC) technique that well utilizes multi-dimensional (MD) source correlation using MD single parity check codes (MD-SPCCs). The source is assumed to be described by the coupling of multiple first-order binary Markov processes. The knowledge about the source correlation is utilized in the channel decoding process where each component decoder utilizes a single dimension correlation of the MD source. To enhance performance and reduce the error floor, a rate-1 recursive systematic convolutional code (RSCC) is serially concatenated to the MD-SPCC via a random interleaver. Two decoding techniques are proposed for each component decoder, and the selection of the decoding technique depends on the strength of the source correlation, which may further enhance the performance of the proposed JSCC technique. Simulation results reveal that a significant performance gain can be achieved by exploiting the MD source correlation with the proposed JSCC technique compared with the case in which the source correlation is not utilized; more significant gains can be achieved with stronger source correlation, and with a larger dimensionality source correlation as well. M. A. M. Izhar UTM-MIMOS Center of Excellence, Faculty of Electrical Engineering, Universiti Teknologi Malaysia (UTM), 81310 Skudai, Johor, Malaysia E-mail: [email protected] X. Zhou School of Computer Science and Technology, Tianjin University, Weijin Road 92, Nankai, Tianjin 300072, China E-mail: [email protected] T. Matsumoto Japan Advanced Institute of Science and Technology (JAIST), 1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan E-mail: [email protected]
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملMulti - Edge Low - Density Parity - Check Coded Modulation
Multi-Edge Low-Density Parity-Check Coded Modulation Lei Zhang Master of Applied Science Graduate Department of Edward Rogers Sr. Department of Electrical and Computer Engineering University of Toronto 2011 A method for designing low-density parity-check (LDPC) codes for bandwidth-efficient high-order coded modulation is proposed. Code structure utilizes the multi-edge-type LDPC code ensemble t...
متن کاملMonomial-like codes
Abstract. As a generalization of cyclic codes of length p over Fpa , we study n-dimensional cyclic codes of length p1 ×· · ·×pn over Fpa generated by a single “monomial”. Namely, we study multi-variable cyclic codes of the form 〈(x1 − 1) i1 · · · (xn − 1) n〉 ⊂ Fq [x1,...,xn] 〈x ps1 1 −1,...,x psn n −1〉 . We call such codes monomial-like codes. We show that these codes arise from the product of ...
متن کاملUsing multi-dimensional parity-check codes to obtain diversity in Rayleigh fading channels
In this paper, we investigate the use of a class of multi-dimensional parity-check (MDPC) codes as a simple and spectrally efficient means to obtain diversity in Rayleigh fading channels. We demonstrate that the MDPC codes can provide a maximum of 4 degrees of diversity, requiring only a minimal amount of added redundancy. We also propose two techniques, namely parallel and serial code concaten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Telecommunication Systems
دوره 62 شماره
صفحات -
تاریخ انتشار 2016